A new form of discrete real Fourier transform and its potential applications

Discrete integer Fourier transform in real space: elliptic Fourier transform

Warped Discrete-Fourier Transform: Theory and Applications

In this paper, we advance the concept of warped discrete-Fourier transform (WDFT), which is the evaluation of frequency samples of the -transform of a finite-length sequence at nonuniformly spaced points on the unit circle obtained by a frequency transformation using an allpass warping function. By factorizing the WDFT matrix, we propose an exact computation scheme for finite sequences using le...

A New Fast Discrete Fourier Transform

This paper presents a new fast Discrete Fourier Transform (DFT) algorithm. By rewriting the DFT, a new algorithm is obtained that uses 2 n?2 (3n?13)+4n?2 real multiplications and 2 n?2 (7n? 29) + 6n + 2 real additions for a real data N = 2 n point DFT, comparable to the number of operations in the Split-Radix method, but with slightly fewer multiply and add operations in total. Because of the o...

The Fast Fourier Transform and Its Applications

The advent of the fast Fourier transform method has greatly extended our ability to implement Fourier methods on digital computers. A description of the alogorithm and its programming is given here and followed by a theorem relating its operands, the finite sample sequences, to the continuous functions they often are intended to approximate. An analysis of the error due to discrete sampling ove...

Dft : Discrete Fourier Transform

A. Table of contents by sections: 1. Abstract (you’re reading this now) 2. Summary of the DFT (How do I do the homework?) 3. Review of continuous-time Fourier series 4. Bandlimited signals and finite Fourier series 5. Sampling theorem for periodic signals 6. Review of quirks of discrete-time frequency 7. Orthogonality and its significance 8. Discrete Fourier Transform (DFT) 9. Use of DFT to com...